- pancyclic graph
- мат.панциклический граф
English-Russian scientific dictionary. 2008.
pancyclic graph
Смотреть что такое "pancyclic graph" в других словарях:
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Outerplanar graph — A maximal outerplanar graph and its 3 coloring. In graph theory, an undirected graph is an outerplanar graph if it can be drawn in the plane without crossings in such a way that all of the vertices belong to the unbounded face of the drawing.… … Wikipedia
Tournament (graph theory) — Tournament A tournament on 4 vertices Vertices n Edges … Wikipedia
Hamiltonian path — This article is about the overall graph theory concept of a Hamiltonian path. For the specific problem of determining whether a Hamiltonian path or cycle exists in a given graph, see Hamiltonian path problem. A Hamiltonian cycle in a dodecahedron … Wikipedia
Graphe planaire extérieur — Un graphe planaire extérieur maximal, muni d un 3 coloriage. En mathématiques, et plus particulièrement en théorie des graphes, un graphe non orienté est planaire extérieur (ou, par calque de l anglais, outer planar) s il peut être dessiné dans… … Wikipédia en Français
Graphe hamiltonien — En théorie des graphes, un graphe hamiltonien est un graphe possédant au moins un cycle passant par tous les sommets une et une seule fois. Un tel cycle élémentaire est alors appelé cycle hamiltonien. Un graphe hamiltonien ne doit pas être… … Wikipédia en Français
Turán's theorem — In graph theory, Turán s theorem is a result on the number of edges in a Kr+1 free graph. An n vertex graph that does not contain any (r + 1) vertex clique may be formed by partitioning the set of vertices into r parts of equal or… … Wikipedia
Ore's theorem — For Ore s theorem in ring theory, see Ore condition. Ore s theorem is a result in graph theory proved in 1960 by Norwegian mathematician Øystein Ore. It gives a sufficient condition for a graph to be Hamiltonian, essentially stating that a graph… … Wikipedia
Frequency partition — In graph theory, a discipline within mathematics, the frequency partition of a graph (simple graph) is a partition of its vertices grouped by their degree.For example, the degree sequence of the left hand graph below is (3, 3, 3, 2, 2, 1) and its … Wikipedia
Cube-connected cycles — The cube connected cycles of order 3, arranged geometrically on the vertices of a truncated cube. In graph theory, the cube connected cycles is an undirected cubic graph, formed by replacing each vertex of a hypercube graph by a cycle. It was… … Wikipedia
John Adrian Bondy — Pour les articles homonymes, voir Bondy (homonymie). John Adrian Bondy, Anglais et Canadien, était professeur de théorie des graphes à l université de Waterloo, au Canada. Il est membre de l Université Lyon 1. Il a donné son nom au théorème Bondy … Wikipédia en Français
